Apr 20, 2012 · Abstract:In this paper, we present a new approach to linearizing zero-one quadratic minimization problem which has many applications in ...

Abstract. In this paper, we present a new approach to linearizing zero-one quadratic minimization problem which has many applications in.

a linearization technique for zero-one polynomial programming problems which replaces each polynomial term with a single additional zero-one variable and two.

PDF | In this paper, we present a new approach to linearizing zero-one quadratic minimization problem which has many applications in computer science.

This paper is concerned with the solution of linearly constrained zero-one quadratic programming problems. Problems of this kind arise in numerous economic, ...

a linearization technique for zero-one polynomial programming problems which replaces each polynomial term with a single additional zero-one variable and two.

ABSTRACT: Balas and Mazzola linearization (BML) is widely used in devising cutting plane algorithms for quadratic 0-1 programs. In this article, we improve BML ...

This paper is concerned with the solution of linearly constrained zero-one quadratic programming problems. Problems of this kind arise in numerous economic, ...

An Improved Linearization Strategy for Zero-One Quadratic Programming Problems ... A tight linearization and an algorithm for zero-one quadraic programming.

ZERO-ONE QUADRATIC PROGRAMMING PROBLEMS*. WARREN P. ADAMS AND HANIF D ... a linearization technique for zero-one polynomial programming problems which.